class Solution {
public:
    struct num
    {
        int count;
        int n;
    };
    int minSetSize(vector<int>& arr) {
        int n = arr.size();
        ranges::sort(arr);
        vector<num> vt;
        for(int i = 0, j = 0; i < n; ++i)
        {
            if(arr[i] == vt[j].n) vt[j].count++;
            else vt[]  
        }
        for(auto& e : mp)
        {

        }
    }
};
